Partition Search
نویسنده
چکیده
We introduce a new form of game search called partition search that incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded. Both theoretical results and experimental data are presented. For the game of bridge, partition search provides approximately as much of an improvement over existing methods as a-0 pruning provides over minimax.
منابع مشابه
A partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملTraining image-based simulation with complex training images using search tree partitioning
Using acomplex training image, such as an analog, for the SNESIM algorithm results in poor simulation since the training image contains trends and may not meet training image requirements. By pooling all the training image patterns in a single search tree but not recording the patterns’ relative locations, some critical features of these complex training images are lost. The search tree partiti...
متن کاملLearning Grammars for Noun Phrase Extraction by Partition Search
This paper describes an application of Grammar Learning by Partition Search to noun phrase extraction, an essential task in information extraction and many other NLP applications. Grammar Learning by Partition Search is a general method for automatically constructing grammars for a range of parsing tasks; it constructs an optimised probabilistic context-free grammar by searching a space of nont...
متن کاملITRI-02-14 Learning Grammars for Noun Phrase Extraction by Partition Search
This paper describes an application of Grammar Learning by Partition Search to noun phrase extraction, an essential task in information extraction and many other NLP applications. Grammar Learning by Partition Search is a general method for automatically constructing grammars for a range of parsing tasks; it constructs an optimised probabilistic context-free grammar by searching a space of nont...
متن کاملAn Improved Lower Bound for Bayesian Network Structure Learning
Several heuristic search algorithms such as A* and breadth-first branch and bound have been developed for learning Bayesian network structures that optimize a scoring function. These algorithms rely on a lower bound function called static k-cycle conflict heuristic in guiding the search to explore the most promising search spaces. The heuristic takes as input a partition of the random variables...
متن کامل